Using Simulated Annealing for knot placement for cubic spline approximation
نویسندگان
چکیده
In this paper, a new methodology is developed for knots placement for cubic spline approximation, using Simulated Annealing. It is not necessary to convert the problem into a discrete combinatorial optimization problem, as presented in other paradigms inspired in genetic algorithm or artificial immune systems, and therefore, removing the constrain of combinatorial optimization problem in the proposed methodology, because the real value of the location of the knots is directly optimized. The accuracy, computationally efficient and robustness of the algorithm presented is compared by different experimental result, with other approaches presented in the bibliography. Key–Words: Cubic spline for approximation. Knots placement. Optimization. Simulated Annealing
منابع مشابه
Knot-removal surface fairing using search strategies
This paper presents two automatic fairing algorithms for parametric C-continuous bi-cubic B-spline surfaces. The fairing method consists of a knot removal and knot reinsertion step which locally smooths the surface. Search strategies like best-first-search and simulated-annealing are searching for the global minimum of the fairing measure. The best-first-search algorithm constructs only partial...
متن کاملFairing Bicubic B-Spline Surfaces using Simulated Annealing
In this paper we present an automatic fairing algorithm for bicubic B-spline surfaces. The fairing method consists of a knot removal and knot reinsertion step which locally smoothes the surface. The simulated-annealing search strategy is used to search for the global minimum of the fairing measure.
متن کاملVectorizing Image Outlines using Spline Computing Approaches with Simulated Annealing
This paper is an overview of three spline approaches of degree one, two and three. It represents the review and comparative study of Linear, conic and cubic splines for the vectorization of outlines of the planar images. It has various phases including extracting outlines of images, detecting corner points from the detected outlines, and curve fitting. The idea of simulated annealing has been i...
متن کاملF0 stylisation with a free-knot B-spline m optimization
This article describes a F0 curve estimation scheme based on a B-spline model1. We compare this model with more classical spline representation. The free parameters of both models are the number of knots and their location. An optimal location is proposed using a simulated annealing strategy. Experiments on real F0 curves confirm the adequacy and good performance of the B-spline approach, estim...
متن کاملNURBS Surface Reconstruction Using Rational B-spline Neural Networks
Surface reconstruction is a very challenging step in Reverse Engineering. It generates a surface from point cloud acquired from a part surface. NURBS surfaces are commonly used for freeform surface reconstruction. There are several algorithms of NURBS surface reconstruction including: Least Squares Methods, simulated annealing, and particle swarm optimization. The major problem of these methods...
متن کامل